On Multidimensional Congestion Games
نویسندگان
چکیده
منابع مشابه
On Lookahead Equilibria in Congestion Games
The definition of the process of interaction among self-interested entities is dependent on the context, and in particular on the set of information available to the players. When they have very little knowledge about each others' costs and strategies, one of the most natural and studied dynamics are sequential best-responses, where players play sequentially and each player selects a strategy w...
متن کاملAtomic Routing Games on Maximum Congestion
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is the global maximum congestion over all edges in the network. We show that the price of stability is 1. The price of anarchy, PoA, is determined by topological properties of the network. In particular, PoA = O(`+ log n)...
متن کاملAtomic Congestion Games with Taxes on Resources
Introduction We consider the following network problem: there are finite number of users in the network. Each user has a non-negligible (or atomic) amount of demand and wants to route her demand from her source to her sink through multiple paths. For each edge in the network, there exists congestion for per unit of flow, which depends on the total amount of flow on this edge. The cost of a user...
متن کاملCongestion games revisited
Strategic games are considered where the players derive their utilities from participation in certain “processes.” Two subclasses consisting exclusively of potential games are singled out. In the first, players choose where to participate, but there is a unique way of participation, the same for all players. In the second, the participation structure is fixed, but each player may have an arbitr...
متن کاملAsynchronous congestion games
We introduce a new class of games, Asynchronous Congestion Games [ACGs]. In an ACG, each player has a task that can be carried out by any element of a set of resources, and each resource executes its assigned tasks in a random order. Each player’s aim is to minimize his expected cost which is the sum of two terms – the sum of the fixed costs over the set of his utilized resources and the expect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2020
ISSN: 1999-4893
DOI: 10.3390/a13100261